Polynomial mixing time of edge flips on quadrangulations
نویسندگان
چکیده
منابع مشابه
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set. The edge cover polynomial of $G$ is the polynomial$E(G,x)=sum_{i=rho(G)}^{m} e(G,i) x^{i}$,where $e(G,i)$ is the number of edge coverings of $G$ of size $i$, and$rho(G)$ is the edge covering number of $G$. In this paper we stud...
متن کاملEdge Flips in Surface Meshes
Little theoretical work has been done on edge flips in surface meshes despite their popular usage in graphics and solid modeling to improve mesh equality. We propose the class of (ε, α)-meshes of a surface that satisfy several properties: the vertex set is an ε-sample of the surface, the triangle angles are no smaller than a constant α, some triangle has a good normal, and the mesh is homeomorp...
متن کاملEdge Flips in Combinatorial Triangulations
Description. In this project, we will investigate a topic that has fascinated geometers for many years: the flip graph of triangulations. Its study dates back to a paper by Wagner from 1936 [5]. Triangulations are planar graphs where every face is a triangle. For the purpose of this project, we will consider abstract unlabeled (i.e. isomorphism classes of) triangulations. Every edge {u, v} in a...
متن کاملExpanders via Local Edge Flips
Designing distributed and scalable algorithms to improve network connectivity is a central topic in peer-to-peer networks. In this paper we focus on the following well-known problem: given an n-node d-regular network for d = Ω(log n), we want to design a decentralized, local algorithm that transforms the graph into one that has good connectivity properties (low diameter, expansion, etc.) withou...
متن کاملConnectivity of Graphs Under Edge Flips
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain exactly one edge from every pair in E . We want to find a graph in G(V, E) that has the minimal number of connected components. We show that, if the edge pairs in E are non-disjoint, the problem is NP-hard. This is true...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability Theory and Related Fields
سال: 2019
ISSN: 0178-8051,1432-2064
DOI: 10.1007/s00440-019-00913-5